package CareerUp.ShortestPathInMattrix;

import java.util.ArrayList;

public class Node {

	int distance = 9999; // keep the shortest distance that can reach this node,
							// by default it's unreachable(9999)

	ArrayList<Node> connectedNodes; // keep reachable nodes from this node
	String name;
	boolean willBeReach = false;; // indicate the node will be reached in next
									// recursion
	boolean isReached = false; // indicate whether the node has ever been
								// reached
	boolean isSource; // record the source

	Node(String n) {
		name = n;
	}

	public void setConnectNodes(ArrayList<Node> nodes) {
		connectedNodes = nodes;
	}

}
